**Leonhard Euler** (1707-1783)
The Konigsberg Bridge Problem is a classic problem, based on the topography of the
city of Konigsberg, Prussia. The city sits along the river Pregel, in which there are
two large islands.
The problem of konigsberg bridge is starting at either the mainland or one of the islands, can one
follow a route which crosses every bridge exactly once? Moreover, if such routes exists,
is there one which begins and ends at the same place? A solution to this problem must
take one of two forms: either an example of such a route, or a proof of why none exists.
The famous Swiss mathematician Leonhard Euler (pronouned “Oiler”) considered and
solved this problem in 1736.
Solution
This Konigsberg Bridge can be solve by using the Euler's solution.
Here, the top and bottom vertices represent the mainland, and the middle two represent
the islands.
Now, to construct an Euler path or circuit, we use Fleury’s algorithm:
1. Pick a vertex as the starting point. (If there are odd-degree vertices, choose one
of these. Otherwise, pick any vertex.)
2. Whenever you have a choice, always choose to travel along an edge that does not
cut off part of the graph.
3. Label the edges in the order in which you travel them.
4. When you can’t travel any more, stop.
5. You already solve the problem of Konigsberg Bridge!!!
+Videos:
Video 1:Solution ofKONIGSBERG BRIDGE PROBLEM
Video 2: Game nV1.4 how to completeBRIDGE of KONIGSBERG
KONIGSBERG BRIDGE PROBLEM
Introduction
**Leonhard Euler**
(1707-1783)
The Konigsberg Bridge Problem is a classic problem, based on the topography of the
city of Konigsberg, Prussia. The city sits along the river Pregel, in which there are
two large islands.
The problem of konigsberg bridge is starting at either the mainland or one of the islands, can one
follow a route which crosses every bridge exactly once? Moreover, if such routes exists,
is there one which begins and ends at the same place? A solution to this problem must
take one of two forms: either an example of such a route, or a proof of why none exists.
The famous Swiss mathematician Leonhard Euler (pronouned “Oiler”) considered and
solved this problem in 1736.
Solution
This Konigsberg Bridge can be solve by using the Euler's solution.
Here, the top and bottom vertices represent the mainland, and the middle two represent
the islands.
Now, to construct an Euler path or circuit, we use Fleury’s algorithm:
1. Pick a vertex as the starting point. (If there are odd-degree vertices, choose one
of these. Otherwise, pick any vertex.)
2. Whenever you have a choice, always choose to travel along an edge that does not
cut off part of the graph.
3. Label the edges in the order in which you travel them.
4. When you can’t travel any more, stop.
5. You already solve the problem of Konigsberg Bridge!!!
+Videos:
Video 1:Solution of KONIGSBERG BRIDGE PROBLEM
Video 2: Game nV1.4 how to complete BRIDGE of KONIGSBERG
Group's Member :
1. ARBAYA BINTI ANGIN (20679)
2. SITI YUHAINIT BINTI HAMZAH (22403)
3. SYAZWANI BINTI HUSSEN (22469)
4. NUR FARHANA DAWAMA BINTI MAZLAN (21922)